/***************************************************************
*   Copyright (C) 2018 All rights reserved.
*
*   Auth     ：Torres Ng
*   Create Time ：2018/10/26
*
***************************************************************/
/**************************************************************
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true

Example 2:

Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Follow up:

Coud you solve it without converting the integer to a string?
***************************************************************/

#include <iostream>

using namespace std;

class Solution {
public:
    bool isPalindrome(int x) {
        if(x < 0) return false; 
        int y = x, z = 0;
        while(y) {
            z *= 10;
            z += y % 10;
            y /= 10;
        }
        return (x == z);
    }
};

int main(void) {
	Solution s = Solution();
    cout << "121: " << boolalpha << s.isPalindrome(121) << endl;
    cout << "-121: " << boolalpha << s.isPalindrome(-121) << endl;
    cout << "10: " << boolalpha << s.isPalindrome(10) << endl;

	return 0;
}
